Generating linear spans over finite fields
نویسندگان
چکیده
منابع مشابه
Generating linear spans over finite fields by Wun - Seng Chou ( Taipei ) and Gary
(1) sk = { vk if k ≤ n , ∑n−1 i=0 aisk−n+i if k > n , consists of all nonzero elements of V for k = 1, . . . , p − 1. Such generating patterns are of interest because they provide simple algorithms for generating the linear span of independent subsets of vector spaces over Fp (see [1] for details). In this paper we generalize a number of the results from [1] by working over Fq where Fq is the f...
متن کاملLinear covering codes over nonbinary finite fields
For a prime power q and for integers R, η with R > 0, 0 ≤ η ≤ R − 1, let A R,q = (Cni)i denote an infinite sequence of q-ary linear [ni, ni − ri]qR codes Cni with covering radius R and such that the following two properties hold: (a) the codimension ri = Rti + η, where (ti)i is an increasing sequence of integers; (b) the length ni of Ci coincides with f (η) q (ri), where f (η) q is an increasin...
متن کاملComputational linear algebra over finite fields
∗Université de Grenoble; Laboratoire Jean Kuntzmann, (umr CNRS 5224, Grenoble INP, INRIA, UJF, UPMF); [email protected]; 51, rue des Mathématiques, BP 53X, F-38041 Grenoble, France. †INRIA, Université de Grenoble; Laboratoire LIG (umr CNRS 5217, Grenoble INP, INRIA, UJF, UPMF); [email protected]; ENSIMAG Antenne de Montbonnot, 51, avenue Jean Kuntzmann, F-38330 Montbonnot Saint-...
متن کاملNilpotent Primitive Linear Groups over Finite Fields
In this paper we investigate the structure of groups as in the title. Our work builds on work of several other authors, namely Konyuh [5], Leedham-Green and Plesken [6], and Zalesskii [10], who have described the abstract isomorphism types of the groups. We obtain more detailed descriptions, in particular explaining how group structure depends on the existence of an abelian primitive subgroup. ...
متن کاملMinimal Linear Codes over Finite Fields
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1992
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-61-2-183-181